Montgomery Multiplication in GF ( 2 k )
نویسندگان
چکیده
We show that the multiplication operation c = a · b · r −1 in the field GF(2 k) can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. This operation is the finite field analogue of the Montgomery multiplication for modular multiplication of integers. We give the bit-level and word-level algorithms for computing the product, perform a thorough performance analysis, and compare the algorithm to the standard multiplication algorithm in GF(2 k). The Montgomery multiplication can be used to obtain fast software implementations of the discrete exponentiation operation, and is particularly suitable for cryptographic applications where k is large.
منابع مشابه
Parallel Montgomery Multiplication in GF (2) using Trinomial Residue Arithmetic
We propose the first general multiplication algorithm in GF (2k) with a subquadratic area complexity of O(k8/5) = O(k1.6). We represent the elements of GF (2k) according to 2n pairwise prime trinomials, T1, . . . , T2n, of degree d, such that nd ≥ k. Our algorithm is based on Montgomery’s multiplication applied to the ring formed by the direct product of the n first trinomials.
متن کاملMontgomery Multiplier and Squarer in GF(2)
Montgomery multiplication in GF(2) is defined by a(x)b(x) r−1(x) mod f(x), where the field is generated by irreducible polynomial f(x), a(x) and b(x) are two field elements in GF(2), and r(x) is a fixed field element in GF(2). In this paper, first we present a generalized Montgomery multiplication algorithm in GF(2). Then by choosing r(x) according to f(x), we show that efficient architecture f...
متن کاملFast Multiplication in Finite Fields GF(2)
A method is described for performing computations in a finite field GF(2 ) by embedding it in a larger ring Rp where the multiplication operation is a convolution product and the squaring operation is a rearrangement of bits. Multiplication in Rp has complexity N +1, which is approximately twice as efficient as optimal normal basis multiplication (ONB) or Montgomery multiplication in GF(2 ), wh...
متن کاملEfficient Unified Arithmetic for Hardware Cryptography
The basic arithmetic operations (i.e. addition, multiplication, and inversion) in finite fields, GF (q), where q = p k and p is a prime integer, have several applications in cryptography, such as RSA algorithm, Diffie-Hellman key exchange algorithm [1], the US federal Digital Signature Standard [2], elliptic curve cryptography [3, 4], and also recently identity based cryptography [5, 6]. Most p...
متن کاملA Scalable and Unified Multiplier Architecture
We describe a scalable and unified architecture for a Montgomery multiplication module which operates in both types of finite fields GF (p) and GF (2). The unified architecture requires only slightly more area than that of the multiplier architecture for the field GF (p). The multiplier is scalable, which means that a fixed-area multiplication module can handle operands of any size, and also, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998